- backtrack processing
- обратное программирование
Англо русский политехнический словарь. Академик.ру. 2011.
backtrack processing
Смотреть что такое "backtrack processing" в других словарях:
clothing and footwear industry — Introduction also called apparel and allied industries, garment industries, or soft goods industries, factories and mills producing outerwear, underwear, headwear, footwear, belts, purses, luggage, gloves, scarfs, ties, and household… … Universalium
Cracking of wireless networks — is the penetration of wireless networks. A wireless network can be penetrated in a number of ways. These ways vary greatly in the level of computer skill and commitment they require. Once within a network, a skilled hacker can modify software,… … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
P600 — This article is about the event related potential. For the mobile phone, see Sendo P600. For the molecule, see Interleukin 13. The P600 is an event related potential (ERP), or peak in electrical brain activity measured by electroencephalography… … Wikipedia
ARM architecture — This article is about a computer processor architecture. For other uses, see ARM (disambiguation). Logo ARM Designer ARM Holdings Bits … Wikipedia
Germany — /jerr meuh nee/, n. a republic in central Europe: after World War II divided into four zones, British, French, U.S., and Soviet, and in 1949 into East Germany and West Germany; East and West Germany were reunited in 1990. 84,068,216; 137,852 sq.… … Universalium
Dancing Links — In computer science, Dancing Links, also known as DLX, is the technique suggested by Donald Knuth to efficiently implement his Algorithm X.[1] Algorithm X is a recursive, nondeterministic, depth first, backtracking algorithm that finds all… … Wikipedia
Constraint optimization — In constraint satisfaction, constrained optimization (also called constraint optimization) seeks for a solution maximizing or minimizing a cost function. Contents 1 Definition 2 Solution methods 2.1 Branch and bound … Wikipedia
Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
Algorithmics of sudoku — The class of Sudoku puzzles consists of a partially completed row column grid of cells partitioned into N regions or zones each of size N cells, to be filled in using a prescribed set of N distinct symbols (typically the numbers {1, ..., N }), so … Wikipedia
Garden path sentence — Garden path sentences are used in psycholinguistics to illustrate that human beings process language one word at a time. The name refers to the saying to be led down the garden path , meaning to be misled . An example is:: The horse raced past… … Wikipedia
